k-Split andk-Non Split Domination of some Zero-Divisor Graphs and its ϑ-Obrazom
نویسندگان
چکیده
The concept of split domination number was introduced by Kulli and Janakiram. Fink Jacobson the notion k-domination in graphs. In this paper, we acquaint with k-split k-non for some zero-divisor graphs ϑ-Obrazom
منابع مشابه
Non Split Domination on Intuitionistic Fuzzy Graphs
A dominating set D of an IFG G = (V, E) is a non-split dominating set, if the induced intuitionistic fuzzy subgraph 〈ܸ − 〉ܦ is connected. The Non-split domination number ߛ ௦ ሺܩሻ of IFG G is the minimum cardinality of all Non-split dominating set. In this paper we study some theorems in Non-split dominating sets of IFG and some results of ߛ ௦ ሺܩሻwith other known parameters of IFG G. 1. In...
متن کاملStrong Non-Split Domination in Directed Graphs
The concept of connectedness plays an important role in many networks. Digraphs are considered as an excellent modeling tool and are used to model many types of relations amongst any physical situations. In this paper the concept of strong non-split domination in directed graph D has been introduced by considering the dominating set S is a strong non-split dominating set if the complement of S ...
متن کاملOn zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کاملOn quasi-zero divisor graphs of non-commutative rings
Let $R$ be an associative ring with identity. A ring $R$ is called reversible if $ab=0$, then $ba=0$ for $a,bin R$. The quasi-zero-divisor graph of $R$, denoted by $Gamma^*(R)$ is an undirected graph with all nonzero zero-divisors of $R$ as vertex set and two distinct vertices $x$ and $y$ are adjacent if and only if there exists $0neq rin R setminus (mathrm{ann}(x) cup mathrm{ann}(y))$ such tha...
متن کاملA generalization of zero-divisor graphs
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of physics
سال: 2021
ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']
DOI: https://doi.org/10.1088/1742-6596/1947/1/012026